On solutions of set-valued optimization problems
نویسندگان
چکیده
منابع مشابه
Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
In this paper, we present a new approach to the study of various efficient solutions of a set-valued equilibrium problem (for short, SEP) through the study of corresponding solutions of a set-valued optimization problem with a geometric constraint (for short, SOP). The solutions under consideration are: efficient solutions, weakly efficient solutions, strongly efficient solutions, and properly ...
متن کاملLagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
The purpose of this paper is to consider the set-valued optimization problem in Asplund spaces without convexity assumption. By a scalarization function introduced by Tammer and Weidner (J Optim Theory Appl 67:297–320, 1990), we obtain the Lagrangian condition for approximate solutions on set-valued optimization problems in terms of the Mordukhovich coderivative.
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملGlobal and local optimality conditions in set-valued optimization problems
Through the paper, X and Y are normed vector spaces; however, most of the results remain true in the more general setting of locally convex spaces. We denote by X∗ and Y∗ the topological dual spaces of X and Y . We consider a pointed closed convex cone Q ⊂ Y which introduces a partial order on Y by the equivalence y1 ≤Q y2 ⇔ y2 − y1 ∈Q; we also suppose, in general, that Q has nonempty interior....
متن کاملWeak Sharp Minima in Set-Valued Optimization Problems
and Applied Analysis 3 x0, y0 ∈ L StrD F, S resp., x0, y0 ∈ LW MinD F, S , if there exists a neighborhood U of x0 in X such that y0 ∈ StrD F U ∩ S ( resp., y0 ∈ W minD F U ∩ S ) , that is, ∀x ∈ S∩U, F x − y0 ∩ −D\{0} ∅ resp. ∀x ∈ S∩U, F x − y0 ∩ − intD ∅. 2.4 We will say that x0, y0 is a global strict global weak minimizers when U X. The set of all global strict minimizers resp., weak minimizer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.06.022